Error estimation and adaptive discretization for the discrete stochastic Hamilton-Jacobi-Bellman equation
نویسنده
چکیده
Generalizing an idea from deterministic optimal control, we construct a posteriori error estimates for the spatial discretization error of the stochastic dynamic programming method based on a discrete Hamilton–Jacobi–Bellman equation. These error estimates are shown to be efficient and reliable, furthermore, a priori bounds on the estimates depending on the regularity of the approximate solution are derived. Based on these error estimates we propose an adaptive space discretization scheme whose performance is illustrated by two numerical examples. AMS Classification: 93E20, 65N50, 49L20, 49M25, 65N15
منابع مشابه
Using Dynamic Programming with Adaptive Grid Schemes for Optimal Control Problems in Economics
The study of the solutions of dynamic models with optimizing agents has often been limited by a lack of available analytical techniques to explicitly find the global solution paths. On the other hand the application of numerical techniques such as dynamic programming (DP) to find the solution in interesting regions of the state state was restricted by the use of fixed grid size techniques. Foll...
متن کاملA Stochastic Optimal Enhancement of Feedback Control for Unicycle Formations
We consider an optimal feedback control approach for multiple nonholonomic vehicles to achieve a distance-based formation with their neighbors using only local observations. Beginning with a non-optimal feedback control for collision-free flocking, each agent determines an additive correction term to its nonoptimal control from an elliptic Hamilton-Jacobi-Bellman equation so that its actions ar...
متن کاملError estimates for finite difference approximations of American put option price
Finite difference approximations to multi-asset American put option price are considered. The assets are modelled as a multi-dimensional diffusion process with variable drift and volatility. Approximation error of order one quarter with respect to the time discretisation parameter and one half with respect to the space discretisation parameter is proved by reformulating the corresponding optima...
متن کاملMultigrid Methods for Second Order Hamilton-Jacobi-Bellman and Hamilton-Jacobi-Bellman-Isaacs Equations
We propose multigrid methods for solving the discrete algebraic equations arising from the discretization of the second order Hamilton–Jacobi–Bellman (HJB) and Hamilton– Jacobi–Bellman–Isaacs (HJBI) equations. We propose a damped-relaxation method as a smoother for multigrid. In contrast with the standard policy iteration, the proposed damped-relaxation scheme is convergent for both HJB and HJB...
متن کاملCombined Fixed Point and Policy Iteration for Hamilton-Jacobi-Bellman Equations in Finance
Implicit methods for Hamilton–Jacobi–Bellman (HJB) partial differential equations give rise to highly nonlinear discretized algebraic equations. The classic policy iteration approach may not be efficient in many circumstances. In this article, we derive sufficient conditions to ensure convergence of a combined fixed point policy iteration scheme for the solution of discretized equations. Numeri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Numerische Mathematik
دوره 99 شماره
صفحات -
تاریخ انتشار 2004